Training Feed-forward Artificial Neural Networks for Pattern-classification Using the Harmony Search Algorithm

نویسندگان

  • Ali Kattan
  • Rosni Abdullah
چکیده

The Harmony Search algorithm is relatively a young stochastic meta-heuristic that was inspired from the improvisation process of musicians. HS has been successfully applied as an optimization method in many scientific and engineering fields and was reported to be competitive alternative to many rivals. In this work a new framework is presented for adapting the HS algorithm as a method for the supervised training of feed-forward artificial neural networks with fixed architectures. Implementation considers a number of pattern classification benchmarking problems and comparisons are made against the traditional Back Propagation training method and an evolutionary based genetic algorithm training method. Results show that the proposed Harmony Search based method has attained results that are on par or better than those of Back Propagation and Genetic Algorithm. However BP seems to have better fine-tuning capabilities than the proposed HS-based method but might take longer overall training time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Training of Feed-Forward Neural Networks for Pattern-Classification Applications Using Music Inspired Algorithm

There have been numerous biologically inspired algorithms used to train feed-forward artificial neural networks such as generic algorithms, particle swarm optimization and ant colony optimization. The Harmony Search (HS) algorithm is a stochastic meta-heuristic that is inspired from the improvisation process of musicians. HS is used as an optimization method and reported to be a competitive alt...

متن کامل

Self-adaptive global best harmony search algorithm for training neural networks

This paper addresses the application of Self-adaptive Global Best Harmony Search (SGHS) algorithm for the supervised training of feed-forward neural networks (NNs). A structure suitable to data representation of NNs is adapted to SGHS algorithm. The technique is empirically tested and verified by training NNs on two classification benchmarking problems. Overall training time, sum of squared err...

متن کامل

Structural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm

In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...

متن کامل

Training neural networks with ant colony optimization algorithms for pattern classification

Feed-forward neural networks are commonly used for pattern classification. The classification accuracy of feed-forward neural networks depends on the configuration selected and the training process. Once the architecture of the network is decided, training algorithms, usually gradient descent techniques, are used to determine the connection weights of the feed-forward neural network. However, g...

متن کامل

Training Feed-Forward Neural Networks Using Firefly Algorithm

In this work, firefly algorithm (FA) is used in training feed-forward neural networks (FNN) for classification purpose. In experiments, three well-known classification problems have been used to evaluate the performance of the proposed FA. The experimental results obtained by FA were compared with the results reported by artificial bee colony (ABC) algorithm and genetic algorithm (GA). Also, si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013